On Safe Folding

In [3] a general fold operation has been introduced for definite programs wrt computed answer substitution semantics. It differs from the fold operation defined by Tamaki and Sato in [26,25] because its application does not depend on the transformation history. This paper extends the results in [3] by giving a more powerful sufficient condition for the preservation of computed answer substitutions. Such a condition is meant to deal with the critical case when the atom introduced by folding depends on the clause to which the fold applies. The condition compares the dependency degree between the fonding atom and the folded clause, with the semantic delay between the folding atom and the ones to be folded. The result is also extended to a more general replacement operation, by showing that it can be decomposed into a sequence of definition, general folding and unfolding operations

A systematic study of models of abstract data types

AbstractThe term-generated models of an abstract data type can be represented by congruence relations on the term algebra. Total and partial heterogeneous algebras are considered as models of hierarchical abstract data types.Particular classes of models are studied and it is investigated under which conditions they form a complete lattice. This theory allows also to describe programming languages (and their semantic models) by abstract types. As example we present a simple deterministic stream processing language

ASCENS: Engineering Autonomic Service-Component Ensembles

Today’s developers often face the demanding task of developing software for ensembles: systems with massive numbers of nodes, operating in open and non-deterministic environments with complex interactions, and the need to dynamically adapt to new requirements, technologies or environmental conditions without redeployment and without interruption of the system’s functionality. Conventional development approaches and languages do not provide adequate support for the problems posed by this challenge. The goal of the ASCENS project is to develop a coherent, integrated set of methods and tools to build software for ensembles. To this end we research foundational issues that arise during the development of these kinds of systems, and we build mathematical models that address them. Based on these theories we design a family of languages for engineering ensembles, formal methods that can handle the size, complexity and adaptivity required by ensembles, and software-development methods that provide guidance for developers. In this paper we provide an overview of several research areas of ASCENS: the SOTA approach to ensemble engineering and the underlying formal model called GEM, formal notions of adaptation and awareness, the SCEL language, quantitative analysis of ensembles, and finally software-engineering methods for ensembles

Abstract Constraint Data Types

Martin Wirsing is one of the earliest contributors to the area of Algebraic Specification (e.g., [2]), which he explored in a variety of domains over many years. Throughout his career, he has also inspired countless researchers in related areas. This paper is inspired by one of the domains that he explored thirty years or so after his first contributions when leading the FET Integrated Project SENSORIA [14]: the use of constraint systems to deal with non-functional requirements and preferences [13,8]. Following in his footsteps, we provide an extension of the traditional notion of algebraic data type specification to encompass soft-constraints as formalised in [1]. Finally, we relate this extension with institutions [6] and recent work on graded consequence in institutions [3].Peer ReviewedPostprint (author’s final draft

A Component-oriented Framework for Autonomous Agents

The design of a complex system warrants a compositional methodology, i.e., composing simple components to obtain a larger system that exhibits their collective behavior in a meaningful way. We propose an automaton-based paradigm for compositional design of such systems where an action is accompanied by one or more preferences. At run-time, these preferences provide a natural fallback mechanism for the component, while at design-time they can be used to reason about the behavior of the component in an uncertain physical world. Using structures that tell us how to compose preferences and actions, we can compose formal representations of individual components or agents to obtain a representation of the composed system. We extend Linear Temporal Logic with two unary connectives that reflect the compositional structure of the actions, and show how it can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components

Forest habitat types on the Medicine Bow National Forest, southeastern Wyoming : preliminary report

A vegetation classification based on concepts and methods developed by Daubenmire was used to identify five habitat types and their related phases on the Medicine Bow National Forest: Abies lasiocarpa/Vaccinium scoparium, including the Pinus contorta/Vaccinium scoparium community; Abies lasiocarpa/Carex geyeri, including the Pinus contorta/Carex geyeri community; Populus tremuloides/Carex geyeri; Pinus ponderosa/Carex geyeri; and Pinus flexilis/Carex geyeri. A key to identify the habitat types and management implications associated with them are provided.Keywords: Vegetation classification, Abies lasiocarpa, Picea engelmannii, Pinus contorta, Pinus ponderosa, Pinus flexilis, Populus tremuloides

Latent class analysis of diagnostic tests for adenovirus, Bordetella pertussis and influenza virus infections in German adults with longer lasting coughs

Laboratory tests in adult outpatients with longer lasting coughs to identify a potential causal pathogen are rarely performed, and there is no gold standard for these diagnostic tests. While the diagnostic validity of serological tests for pertussis is well established their potential contribution for diagnosing adenovirus and influenza virus A and B infections is unclear. A sentinel study into the population-based incidence of longer lasting coughs in adults was done in Rostock (former East Germany) and Krefeld (former West Germany). A total of 971 outpatients who consulted general practitioners or internists were included. Inclusion criteria were coughing for 51 week and no chronic respiratory diseases. We evaluated the performance of polymerase chain reaction (PCR) as well as IgG and IgA serology, applying a latent class model for diagnosing infections with adenovirus, B. pertussis, and influenza virus A and B. The adult outpatients first sought medical attention when they had been coughing for a median of 3 weeks. In this situation, direct detection of infectious agents by PCR had a low sensitivity. Modelling showed that additional serological tests equally improved sensitivity and specificity for diagnosis for adenovirus, B. pertussis and influenza virus A and B infections. The combination of serology and PCR may improve the overall performance of diagnostic tests for B. pertussis and also for adenovirus, and influenza virus A and B infections